Statistical Modeling of Huffman Tables Coding
نویسندگان
چکیده
An innovative algorithm for automatic generation of Huffman coding tables for semantic classes of digital images is presented. Collecting statistics over a large dataset of corresponding images, we generated Huffman tables for three images classes: landscape, portrait and document. Comparisons between the new tables and the JPEG standard coding tables, using also different quality settings, have shown the effectiveness of the proposed strategy in terms of final bit size (e.g. compression ratio).
منابع مشابه
Huffman Modeling for DCT Based Coding
In this paper we present a statistical modeling for DCT events frequency distribution for three images classes: landscape, portrait and document. We show that it is possible to fit a mathematical model capturing the underlying statistical distribution. This modeling allows us to automatically generate optimized Huffman tables for each quality factor involved in the compression engine.
متن کاملA VLSI Architecture for Reference Frame Compression on High Definition Video Coding Systems
This paper presents a hardware-friendly solution for external memory bandwidth reduction focusing in the state-ofart video encoders, like H.264/AVC and HEVC. The proposed approach is based on reference frame compression using an adaptation of the traditional Huffman algorithm and is a lossless solution. This solution is entitled RFCAVLC8t (Reference Frame Context Adaptive Variable-Length Coder ...
متن کاملA Phrase Table without Phrases: Rank Encoding for Better Phrase Table Compression
This paper describes the first steps towards a minimum-size phrase table implementation to be used for phrase-based statistical machine translation. The focus lies on the size reduction of target language data in a phrase table. Rank Encoding (REnc), a novel method for the compression of word-aligned target language in phrase tables is presented. Combined with Huffman coding a relative size red...
متن کاملImproving Chinese Storing Text Retrieval Systems' Security via a Novel Maximal Prefix Coding
As we have seen that Huffman coding has been widely used in data, image, and video compression. In this paper novel maximal prefix coding is introduced. Relationship between the Huffman coding and the optimal maximal prefix coding are discussed. We show that all Huffman coding schemes are optimal maximal prefix coding schemes and that conversely the optimal maximal prefix coding schemes need no...
متن کاملSecuring Multimedia Transmission Using Optimized Multiple Huffman Tables Technique
Multimedia is one of the most popular data shared in the Web, and the protection of it via encryption techniques is of vast interest. In this paper, an Optimized Multiple Huffman Tables (OMHT) technique is proposed to face some compression and security problems found in Multiple Huffman Tables (MHT) technique. OMHT depends on using statistical-modelbased compression method to generate different...
متن کامل